A novel algorithm and its convergence for a class of combinatorial optimization problems 一類組合優化問題的新解法及其收斂性
This paper studies the approximation algorithms of some combinatorial optimization problems 本文主要研究組合優化中若干問題的近似算法。
In addition , simulated annealing algorithm for the combinatorial optimization problem here is also given 此外,利用模擬退火算法成功地解決了該組合優化問題。
Packing problems are categorized as discrete combinatorial optimization problems with np - complete computational complexities 布局問題是具有np完備計算復雜度的離散組合優化問題。
Grouping problem is combinatorial optimization problem which is effective to solve by genetic algorithm 成組技術問題是組合優化問題,而遺傳算法正是目前求解組合最優化的有效方法之一。
The cast grouping and ordering problem of steelmaking continuous casting hot rolling ( sm - cc ) is a combinatorial optimization problem 摘要煉鋼-連鑄生產的澆次組合與排序是帶有工藝約束的并行機流水車間調度問題。
The optimization of gear parameters in designing movements of clocks and watches is a combinatorial optimization problem . it is difficult to solve the problem 鐘手表機芯設計中齒輪參數的優化設計問題是一個組合優化問題,很難用傳統優化方法解決。
Scheduling is one kind of important combinatorial optimization problem , which use some processors , machines or resources to accomplish optimally a batch of given tasks or jobs 排序問題研究的是若干個任務要在一些機器上進行加工,如何安排機器和任務使得某些要求(目標函數)達到最優的問題。
Recently , genetic algorithm has been tyied to resolve variable combinatorial optimization problems , such as job scheduling problem , but but has began just now in vsp 近些年來,人們在用遺傳算法解決現實中的各種組合優化問題上進行了探索,如在生產調度問題中的應用,但在車輛調度問題中的應用才剛剛開始。
In the rest of the thesis , we study approximation algorithms with their worst - case analysis for four different combinatorial optimization problems . in chapter 2 , we consider the optimization versions of the 3 - partitioning and the kernel 3 - partitioning problems 在第二章至第五章中,我們分別研究了四個組合優化問題的近似算法,并給出了它們的性能分析。